Singly linked lists are a powerful abstraction that allow you to represent numerous types of data 單鏈表是讓您可以描述多種類(lèi)型數(shù)據(jù)的一種有效抽象。
Conceptually , a singly linked list of integers looks like the following diagram in a computer s memory 從概念上講,在計(jì)算機(jī)內(nèi)存中,整數(shù)的單鏈表如下圖所示:
Using a singly linked list saves the overhead of updating an additional pointer for all operations as well as the memory for that pointer 使用單向鏈接表可省去更新所有操作的附加指針以及該指針的內(nèi)存的系統(tǒng)開(kāi)銷(xiāo)。
This article will discuss only singly linked lists ; the terms " linked lists " and " lists " will both be used to mean singly linked lists 本文將只討論單鏈表;術(shù)語(yǔ)“鏈表( linked list ) ”和“列表( list ) ”都被用來(lái)表示單鏈表。